A Formula for the R-matrix Using a System of Weight Preserving Endomorphisms
نویسنده
چکیده
We give a formula for the universal R-matrix of the quantized universal enveloping algebra Uq(g). This is similar to a previous formula due to Kirillov-Reshetikhin and Levendorskii-Soibelman, except that where they use the action of the braid group element Tw0 on each representation V , we show that one can instead use a system of weight preserving endomorphisms. One advantage of our construction is that it is well defined for all symmetrizable Kac-Moody algebras. However we have only established that the result in equal to the universal R-matrix in finite type.
منابع مشابه
Strongly clean triangular matrix rings with endomorphisms
A ring $R$ is strongly clean provided that every element in $R$ is the sum of an idempotent and a unit that commutate. Let $T_n(R,sigma)$ be the skew triangular matrix ring over a local ring $R$ where $sigma$ is an endomorphism of $R$. We show that $T_2(R,sigma)$ is strongly clean if and only if for any $ain 1+J(R), bin J(R)$, $l_a-r_{sigma(b)}: Rto R$ is surjective. Furt...
متن کاملRing endomorphisms with nil-shifting property
Cohn called a ring $R$ is reversible if whenever $ab = 0,$ then $ba = 0$ for $a,bin R.$ The reversible property is an important role in noncommutative ring theory. Recently, Abdul-Jabbar et al. studied the reversible ring property on nilpotent elements, introducing the concept of commutativity of nilpotent elements at zero (simply, a CNZ ring). In this paper, we extend the CNZ pr...
متن کاملLinear Functions Preserving Sut-Majorization on RN
Suppose $textbf{M}_{n}$ is the vector space of all $n$-by-$n$ real matrices, and let $mathbb{R}^{n}$ be the set of all $n$-by-$1$ real vectors. A matrix $Rin textbf{M}_{n}$ is said to be $textit{row substochastic}$ if it has nonnegative entries and each row sum is at most $1$. For $x$, $y in mathbb{R}^{n}$, it is said that $x$ is $textit{sut-majorized}$ by $y$ (denoted by $ xprec_{sut} y$) if t...
متن کاملLinear maps preserving or strongly preserving majorization on matrices
For $A,Bin M_{nm},$ we say that $A$ is left matrix majorized (resp. left matrix submajorized) by $B$ and write $Aprec_{ell}B$ (resp. $Aprec_{ell s}B$), if $A=RB$ for some $ntimes n$ row stochastic (resp. row substochastic) matrix $R.$ Moreover, we define the relation $sim_{ell s} $ on $M_{nm}$ as follows: $Asim_{ell s} B$ if $Aprec_{ell s} Bprec_{ell s} A.$ This paper characterizes all linear p...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کامل